题目传送门:https://vijos.org/p/1196
卧槽,这个和1655不一毛一样吗?
#include<iostream> #include<cstdio> #include<cstring> using namespace std; const int MAXN = 100000; char s1[MAXN],s2[MAXN]; int l1,l2; inline bool leg(int c){ return c == 2 || c == 3 || c == 7 || c == 8; } int main(){ while (scanf("%s%s",s1+1,s2+1) == 2){ l1 = strlen(s1+1); l2 = strlen(s2+1); if (leg(s1[l1]-'0') && leg(s2[l2]-'0')) cout<<"Shadow"<<endl; else cout<<"Matrix67"<<endl; } return 0; }
I view something really special in this web site.
Howdy, i read your blog occasionally and i own a similar one and i was just wondering if you get a lot of spam comments? If so how do you protect against it, any plugin or anything you can suggest? I get so much lately it’s driving me mad so any support is very much appreciated.